Kinematic Formulas for Finite Lattices
نویسنده
چکیده
In analogy to valuation characterizations and kinematic formulas of convex geometry, we develop a combinatorial theory of invariant valuations and kinematic formulas for finite lattices. Combinatorial kinematic formulas are shown to have application to some probabilistic questions, leading in turn to polynomial identities for Möbius functions and Whitney numbers.
منابع مشابه
FUZZY ORDERED SETS AND DUALITY FOR FINITE FUZZY DISTRIBUTIVE LATTICES
The starting point of this paper is given by Priestley’s papers, where a theory of representation of distributive lattices is presented. The purpose of this paper is to develop a representation theory of fuzzy distributive lattices in the finite case. In this way, some results of Priestley’s papers are extended. In the main theorem, we show that the category of finite fuzzy Priestley space...
متن کاملThe Variety of Residuated Lattices is Generated by its Finite Simple Members
In this paper, we will show that the variety of residuated lattices is generated by finite simple residuated lattices. The “simplicity” part of the proof is based on Grǐsin’s idea from [5], whereas the “finiteness” part employs a kind of algebraic filtration argument. Since the set of formulas valid in all residuated lattices is equal to the set of formulas provable in the propositional logic F...
متن کاملDual characterizations for finite lattices via correspondence theory for monotone modal logic
We establish a formal connection between algorithmic correspondence theory and certain dual characterization results for finite lattices, similar to Nation’s characterization of a hierarchy of pseudovarieties of finite lattices, progressively generalizing finite distributive lattices. This formal connection is mediated through monotone modal logic. Indeed, we adapt the correspondence algorithm ...
متن کاملNondirected lattice paths on different lattices
We study excursions with jumps to nearest neighbors in different lattices (hexagonal, triangular, kagome, Manhattan lattices), paths in a strip, etc. We show that some families are algebraic, D-finite, and give some nice closed form formulas.
متن کاملCANONICAL FORMULAS FOR k-POTENT COMMUTATIVE, INTEGRAL, RESIDUATED LATTICES
Canonical formulas are a powerful tool for studying intuitionistic and modal logics. Indeed, they provide a uniform and semantic way of axiomatising all extensions of intuitionistic logic and all modal logics above K4. Although the method originally hinged on the relational semantics of those logics, recently it has been completely recast in algebraic terms. In this new perspective canonical fo...
متن کامل